mirror of
				https://gitee.com/coder-xiaomo/leetcode-problemset
				synced 2025-10-31 09:43:11 +08:00 
			
		
		
		
	
		
			
				
	
	
		
			51 lines
		
	
	
		
			1.5 KiB
		
	
	
	
		
			HTML
		
	
	
	
	
	
			
		
		
	
	
			51 lines
		
	
	
		
			1.5 KiB
		
	
	
	
		
			HTML
		
	
	
	
	
	
| <p>给你一个字符串 <code>word</code>。如果 <code>word</code> 中同时存在某个字母的小写形式和大写形式,则称这个字母为 <strong>特殊字母</strong> 。</p>
 | |
| 
 | |
| <p>返回 <code>word</code> 中<strong> </strong><strong>特殊字母 </strong>的数量。</p>
 | |
| 
 | |
| <p> </p>
 | |
| 
 | |
| <p><strong class="example">示例 1:</strong></p>
 | |
| 
 | |
| <div class="example-block">
 | |
| <p><strong>输入:</strong><span class="example-io">word = "aaAbcBC"</span></p>
 | |
| 
 | |
| <p><strong>输出:</strong><span class="example-io">3</span></p>
 | |
| 
 | |
| <p><strong>解释:</strong></p>
 | |
| 
 | |
| <p><code>word</code> 中的特殊字母是 <code>'a'</code>、<code>'b'</code> 和 <code>'c'</code>。</p>
 | |
| </div>
 | |
| 
 | |
| <p><strong class="example">示例 2:</strong></p>
 | |
| 
 | |
| <div class="example-block">
 | |
| <p><strong>输入:</strong><span class="example-io">word = "abc"</span></p>
 | |
| 
 | |
| <p><strong>输出:</strong><span class="example-io">0</span></p>
 | |
| 
 | |
| <p><strong>解释:</strong></p>
 | |
| 
 | |
| <p><code>word</code> 中不存在大小写形式同时出现的字母。</p>
 | |
| </div>
 | |
| 
 | |
| <p><strong class="example">示例 3:</strong></p>
 | |
| 
 | |
| <div class="example-block">
 | |
| <p><strong>输入:</strong><span class="example-io">word = "abBCab"</span></p>
 | |
| 
 | |
| <p><strong>输出:</strong>1</p>
 | |
| 
 | |
| <p><strong>解释:</strong></p>
 | |
| 
 | |
| <p><code>word</code> 中唯一的特殊字母是 <code>'b'</code>。</p>
 | |
| </div>
 | |
| 
 | |
| <p> </p>
 | |
| 
 | |
| <p><strong>提示:</strong></p>
 | |
| 
 | |
| <ul>
 | |
| 	<li><code>1 <= word.length <= 50</code></li>
 | |
| 	<li><code>word</code> 仅由小写和大写英文字母组成。</li>
 | |
| </ul>
 | 
